منابع مشابه
A Data-Centric View on Computational Complexity: P $\not =$ NP
P 6= NP ⇔ SAT 6∈ P . We propose this to be true because the satisfiability problem for propositional logic formulas (SAT) is the Halting Problem [Turing, 1937] in disguise and therefore undecidable. Since the input space is finite, however, SAT can still be solved by simulating no less than all possible, that is exponentially many, configurations. In a nutshell, the halting portion of a program...
متن کاملP, NP and Mathematics – a computational complexity perspective
The P versus NP question distinguished itself as the central question of Theoretical Computer Science nearly four decades ago. The quest to resolve it, and more generally, to understand the power and limits of efficient computation, has led to the development of Computational Complexity Theory. While this mathematical discipline in general, and the P vs. NP problem in particular, have gained pr...
متن کاملComputational Complexity, NP Completeness and Optimization Duality: A Survey
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.
متن کاملDuality Gap, Computational Complexity and NP Completeness: A Survey
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.
متن کاملOn the P versus NP intersected with co-NP question in communication complexity
We consider the analog of the P versus NP∩ co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation ¬f have small (poly-logarithmic in the number of variables) nondeterministic communication complexity, what is then its deterministic and/or probabilistic communication com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2010
ISSN: 0001-0782,1557-7317
DOI: 10.1145/1839676.1839677